Equational Axiomization of Bicoercibility for Polymorphic Types
نویسنده
چکیده
Two polymorphic types and are said to be bicoercible if there is a coercion from to and conversely. We give a complete equational axiomatization of bicoercible types and prove that the relation of bicoercibility is decidable.
منابع مشابه
Equational Axiomatization of Bicoercibility for Polymorphic Types
Two polymorphic types and are said to be bicoercible if there is a coercion from to and conversely. We give a complete equational axiomatization of bicoercible types and prove that the relation of bicoercibility is decidable.
متن کاملDimension Inference under Polymorphic
Numeric types can be given polymorphic dimension parameters , in order to avoid dimension errors and unit errors. The most general dimensions can be inferred automatically. It has been observed that polymorphic recursion is more important for the dimensions than for the proper types. We show that, under polymorphic recursion, type inference amounts to syntactic semi-uniication of proper types, ...
متن کاملMultiversal Polymorphic Algebraic Theories
We formalise and study the notion of polymorphic algebraic theory, as understood in the mathematical vernacular as a theory presented by equations between polymorphically-typed terms with both type and term variable binding. The prototypical example of a polymorphic algebraic theory is System F, but our framework applies more widely. The extra generality stems from a mathematical analysis that ...
متن کاملOn the complexities of polymorphic stream equation systems, isomorphism of finitary inductive types, and higher homotopies in univalent universes
This thesis is composed of three separate parts. The first part deals with definability and productivity issues of equational systems defining polymorphic stream functions. The main result consists of showing such systems composed of only unary stream functions complete with respect to specifying computable unary polymorphic stream functions. The second part deals with syntactic and semantic no...
متن کاملAdding Equations to System F Types
We present an extension of System F with types for termlevel equations. This internalization of the rich equational theory of the polymorphic lambda calculus yields an expressive core language, suitable for formalizing features such as Haskell’s rewriting rules mechanism or Extended ML signatures.
متن کامل